O(log n) dynamic packet routing
نویسندگان
چکیده
A data structure that permits you to find longest matching prefixes as well as to insert and delete a prefix in O(logn) time, where n is the number of prefixes in the router table is developed. Experiment results using a real IPv4 routing database are also presented.
منابع مشابه
An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines
We study the problem of online packet routing in dynamic store-and-forward directed line networks. We present a centralized randomized online algorithm that achieves a throughput that is O(log n)-competitive, where n denotes the number of nodes. Our algorithm is applicable to all values of buffer sizes and communication link capacities. In particular, it holds also for unit buffers. This algori...
متن کاملPacket Routing and Information Gathering in Lines, Rings and Trees
We study the problem of online packet routing and information gathering in lines, rings and trees. A network consists of n nodes. At each node there is a buffer of size B. Each buffer can transmit one packet to the next buffer at each time step. The packets injection is under adversarial control. Packets arriving at a full buffer must be discarded. In information gathering all packets have the ...
متن کاملDirect Routing on Trees (Extended Abstract)
We consider oo-line permutation routing on trees. We are particularly interested in direct tree routing schedules where packets once started move directly towards their destination. The scheduling of start times ascertains that no two packets will use the same edge in the same direction in the same time step. In O(n log n log log n) time and O(n log n) space, we construct a direct tree routing ...
متن کاملBetter Online Deterministic Packet Routing on Grids
We consider the following fundamental routing problem. An adversary inputs packets arbitrarily at sources, each packet with an arbitrary destination. Traffic is constrained by link capacities and buffer sizes, and packets may be dropped at any time. The goal of the routing algorithm is to maximize throughput, i.e., route as many packets as possible to their destination. Our main result is an O ...
متن کاملProbabilistic routing in wavelength-routed multistage, hypercube, and Debruijn networks
Optical networks based on wavelength division multi-plexing (WDM) and wavelength routing are considered to be potential candidates for the next generation of wide area networks. One of the main issues in these networks is the development of eecient routing algorithms which require minimum number of wavelengths. In this paper, we focus on the permutation routing problem in multi-stage WDM networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002